Theory for Software Verification

interpretation. Theo. Comp. Sci. 277, 1–2, 47–103. Cousot, P. and Cousot, R. 1977. Abstract interpretation: a unified lattice model for staticanalysis of programs by construction or approximation of fixpoints. In ACM Symp. on Prin. of Prog. Lang. 238–252. Cousot, P. and Cousot, R. 1992. Inductive definitions, semantics and abstract interpretation. In ACM Symp. on Prin. of Prog. Lang. 83–94. Cousot, P. and Cousot, R. 2000. Temporal abstract interpretation. In ACM Symp. on Prin. of Prog. Lang. 12–25. Crary, K. and Harper, R. 2007. Syntactic logical relations for polymorphic and recursive types. In Computation, Meaning and Logic: Articles dedicated to Gordon Plotkin. Electronic Notesin Theoretical Computer Science, vol. 172. 259–299. Darvas, A., Hähnle, R., and Sands, D. 2005. A theorem proving approach to analysis of secureinformation flow. In Conf. on Security in Pervasive Computing. LNCS, vol. 3450. 193–209. de Roever, W.-P. and Engelhardt, K. 1998. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge U. Press. DeNicola, R. and Hennessy, M. 1984. Testing equivalences for processes. Theo. Comp. Sci. 34,